Eliciting GAI preference models with binary attributes aided by association rule mining

نویسندگان

  • Sergio Queiroz
  • Luiz Freire
چکیده

Generalized additive independent (GAI) preference models are, in many situations, more interesting than additive models, as GAI models allow interdependencies between attributes. However, they are more difficult to construct (elicit), not only because the number of questions needed to be asked increases, but also because we must know what the interdependencies are, i.e. the structure of the model. We introduce the use of association rules to select attributes and detect simple interactions between them during an interactive preference elicitation process that intends to build a GAI utility function for the preferences of the user of a recommender system. Using this strategy, we have built a recommender system prototype that suggests touristic sites in a city. We show that, after the elicitation, the recommendation problem can be solved as an instance of the non-linear generalized additive knapsack problem.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Preference Elicitation and Generalized Additive Utility

Any automated decision support software must tailor its actions or recommendations to the preferences of different users. Thus it requires some representation of user preferences as well as a means of eliciting or otherwise learning the preferences of the specific user on whose behalf it is acting. While additive preference models offer a compact representation of multiattribute utility functio...

متن کامل

Weighted Association Rule Mining from Binary and Fuzzy Data

A novel approach is presented for mining weighted association rules (ARs) from binary and fuzzy data. We address the issue of invalidation of downward closure property (DCP) in weighted association rule mining where each item is assigned a weight according to its significance w.r.t some user defined criteria. Most works on weighted association rule mining so far struggle with invalid downward c...

متن کامل

A Novel Rule Ordering Approach in Classification Association Rule Mining

A Classification Association Rule (CAR), a common type of mined knowledge in Data Mining, describes an implicative co-occurring relationship between a set of binary-valued data-attributes (items) and a pre-defined class, expressed in the form of an “antecedent ⇒ consequent-class” rule. Classification Association Rule Mining (CARM) is a recent Classification Rule Mining (CRM) approach that build...

متن کامل

Combined use of association rules mining and clustering methods to find relevant links between binary rare attributes in a large data set

A method to analyse links between binary attributes in a large sparse data set is proposed. Initially the variables are clustered to obtain homogeneous clusters of attributes. Association rules are then mined in each cluster. A graphical comparison of some rule relevancy indexes is presented. It is used to extract best rules depending on the application concerned. The proposed methodology is il...

متن کامل

Application of Kansei engineering and data mining in the Thai ceramic manufacturing

Ceramic is one of the highly competitive products in Thailand. Many Thai ceramic companies are attempting to know the customer needs and perceptions for making favorite products. To know customer needs is the target of designers and to develop a product that must satisfy customers. This research is applied Kansei Engineering (KE) and Data Mining (DM) into the customer driven product design proc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009